A fast path planning by path graph optimization

نویسندگان

  • Joo Young Hwang
  • Jun Song Kim
  • Sang Seok Lim
  • Kyu Ho Park
چکیده

In this paper, a fast path planning method by optimization of a path graph for both efficiency and accuracy is proposed. A conventional quadtree-based path planning approach is simple, robust, and efficient. However, it has two limitations. The first limitation is that many small cells are required to represent obstacles because the positions and shapes of the cells are not object-dependent and searching the shortest path in the path graph is slow. The second limitation is generation of nonoptimal paths due to large cells in a free space. The cost of traversing a cell is the same whether a path just clips a corner of the cell or actually passes through the entire width of the cell. The quadtree is very sensitive to obstacle placement and the error factor is proportional to the size of the cell. We propose a path graph optimization technique employing a compact mesh representation. A world space is triangulated into a base mesh and the base mesh is simplified to a compact mesh. The compact mesh representation is object-dependent; the positions of vertexes of the mesh are optimized according to the curvatures of the obstacles. The compact mesh represents the obstacles as accurately as the quadtree even though using much fewer vertexes than the quadtree. The compact mesh distributes vertexes in a free space in a balanced way by ensuring that the lengths of edges are below an edge length threshold. An optimized path graph is extracted from the compact mesh. An iterative vertex pushing method is proposed to include important obstacle boundary edges in the path graph. Dijkstra’s shortest path searching algorithm is used to search the shortest path in the path graph. Experimental results show that the path planning using the optimized path graph is an order of magnitude faster than the quadtree approach while the length of the path generated by the proposed method is almost the same as that of the path generated by the quadtree.

منابع مشابه

مسیریابی حرکت روبات‌های ماشین‌واره با روش پیشروی سریع

The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...

متن کامل

Centralized Path Planning for Multi-aircraft in the Presence of Static and Moving Obstacles

This article proposes a new approach for centralized path planning of multiple aircraft in presence of the obstacle-laden environment under low flying rules. The problem considers as a unified nonlinear constraint optimization problem. The minimum time and control investigate as the cost functions and the maximum velocity and power consider as the constraints. The pseudospectral method applies ...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

SmartPATH: An Efficient Hybrid ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots

Path planning is a fundamental optimization problem that is crucial for the navigation of a mobile robot. Among the vast array of optimization approaches, we focus in this paper on Ant Colony Optimization (ACO) and Genetic Algorithms (GA) for solving the global path planning problem in a static environment, considering their effectiveness in solving such a problem. Our objective is to design an...

متن کامل

Constructing probabilistic roadmaps with powerful local planning and path optimization

This paper describes a new approach to probabilistic roadmap construction for path planning. The novel feature of the planner is that it uses a powerful local planner to produce highly connected roadmaps and path optimization to maintain the rapid query processing by a fast local operator. While most previous approaches obtain good roadmaps by advanced sampling methods, the presented approach c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:
  • IEEE Trans. Systems, Man, and Cybernetics, Part A

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2003